Path finding strategies in scale-free networks
نویسندگان
چکیده
منابع مشابه
Path-Finding in Networks
Algorithms that find connections between concepts in semantic networks are inherently inefficient due to their dependence on piecemeal representation of potential paths. A method of reorganizing a link-based network into a path-based representation is argued to allow more efficient search techniques. A path-based representation is presented in terms of the knowledge representation language Conc...
متن کاملFast Algorithm for Finding Maximum Clique in Scale-Free Networks
The maximum clique problem in graph theory concerns finding the largest subset of vertices in which all vertices are connected with an edge. Computation of such subset is a well-known NP-hard problem and there exist many algorithms to solve it. For our purposes we created an algorithm specially targeted for solving this problem in scale-free networks, where many significant search improvements ...
متن کاملFinding important hubs in scale-free gene networks
Several biological networks have been recently found to demonstrate scale-free and smallworld behavior instead of random graph characteristics. It is very important to find the hubs (genes, proteins, metabolites and so on) which dominate the topology of scale-free networks, since those are usually of great biological significance. In this paper, we will develop a general information theory meth...
متن کاملImproved routing strategies for data traffic in scale-free networks
We study the information packet routing process in scale-free networks by mimicking Internet traffic delivery. We incorporate both the global shortest paths information and local degree information of the network in the dynamic process, via two tunable parameters, α and β, to guide the packet routing. We measure the performance of the routing method by both the average transit times of packets ...
متن کاملEfficient routing strategies in scale-free networks with limited bandwidth
We study the traffic dynamics in complex networks where each link is assigned a limited and identical bandwidth. Although the first-in-first-out (FIFO) queuing rule is widely applied in the routing protocol of information packets, here we argue that if we drop this rule, the overall throughput of the network can be remarkably enhanced. We propose some efficient routing strategies that do not st...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2002
ISSN: 1063-651X,1095-3787
DOI: 10.1103/physreve.65.027103